Two Embedding Theorems for Finite Lattices
نویسنده
چکیده
Introduction. One of the important unsolved problems of lattice theory is the problem of embedding every finite lattice in a finite partition lattice. The partition lattice can be considered as the lattice of subspaces of a suitable geometry. By slightly loosening the conditions on this geometry it will be shown that every finite lattice can be embedded in the lattice of subspaces of a finite geometry. Using this result it will be shown that every finite lattice can be embedded in the lattice of all geometries on a finite set. The lattice of all geometries will be shown to be again the lattice of subspaces of a geometry and it will be seen that its structure is similar to that of a partition lattice. This reduces the above mentioned problem to the problem of embedding every finite lattice of geometries in a finite partition lattice.
منابع مشابه
FUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملEmbedding Finite Lattices into the Computably Enumerable Degrees — a Status Survey
We survey the current status of an old open question in classical computability theory: Which finite lattices can be embedded into the degree structure of the computably enumerable degrees? Does the collection of embeddable finite lattices even form a computable set? Two recent papers by the second author show that for a large subclass of the finite lattices, the so-called join-semidistributive...
متن کاملA Survey of Tensor Products and Related Constructions in Two Lectures
We survey tensor products of lattices with zero and related constructions focused on two topics: amenable lattices and box products. PART I. FIRST LECTURE: AMENABLE LATTICES Abstract. Let A be a finite lattice. Then A is amenable (A⊗B is a lattice, for every lattice B with zero) iff A (as a join-semilattice) is sharply transferable (whenever A has an embedding φ into IdL, the ideal lattice of a...
متن کامل2 2 Ja n 20 05 EMBEDDING FINITE LATTICES INTO FINITE BIATOMIC LATTICES
For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, — The class of all finite lattices; — The class of all finite lower bounded lattices (solved by the first author's earlier work). — The class of all finite join-semidistributive lattices (th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010